“In an Unbounded Way”

Competitive Algorithms for Unbounded One-Way Trading

In the one-way trading problem, a seller has some product to be sold to a sequence σ of buyers u1, u2, . . . , uσ arriving online and he needs to decide, for each ui, the amount of product to be sold to ui at the then-prevailing market price pi. The objective is to maximize the seller’s revenue. We note that most previous algorithms for the problem need to impose some artificial upper bound M a...

Rethinking Philosophy in an Oriental Way

Unbounded-Error One-Way Classical and Quantum Communication Complexity

This paper studies the gap between quantum one-way communication complexity Q(f) and its classical counterpart C(f), under the unbounded-error setting, i.e., it is enough that the success probability is strictly greater than 1/2. It is proved that for any (total or partial) Boolean function f , Q(f) = ⌈C(f)/2⌉, i.e., the former is always exactly one half as large as the latter. The result has a...

Broadcast Authentication with Practically Unbounded One-way Chains

A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains constructed with the squaring function which gives the possibility to construct a one-way chain of whose length is unbounded in practice. Although the computational cost is somewhat increased, compared to the use of hash...

How to Fool an Unbounded